Generic Completion ( Version 1 ) Reinhard

نویسنده

  • Reinhard Bündgen
چکیده

Abstract rewrite systems define a reduction relation by a set of rules. An important aspect of such rewrite relations is their behavior in an arbitrary context associated with the underlying congruence relation. This behavior is described by “compatibility properties”: a rewrite system is compatible if applying the same context to two objects preserves the rewrite relation among them. We present a generic completion procedure for abstract rewrite systems and characterize the minimal compatibility requirement for rewrite relations that are necessary to describe completion procedures as proof transformation procedures. This requirement (called sufficient compatibility) subsumes the class of semi-compatible rewrite relations that play an important rôle in algebraic completion. In order to allow for non-compatible rewrite relations we must replace the concept of equations (critical pairs) by promises which leads to a new proof transformation relation and a new proof ordering for abstract rewrite systems. This proof ordering also yields a uniform framework that explains consistency of different redundancy criteria better than previous frameworks.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Combining Reductions and Computations in ReDuX

ReDuX [1, 4] is a term rewriting laboratory mainly aimed at theorem proving and completion procedures. ReDuX comprises several variants of Knuth-Bendix completion including a version supporting associative commutative operators and an inductive completion procedure. Several term orderings are available as well as a random term generator and a program to automatically analyze the set of irreduci...

متن کامل

. A C ] 1 2 A ug 2 00 3 GENERIC COHEN - MACAULAY MONOMIAL IDEALS

Given a simplicial complex, it is easy to construct a generic deformation of its Stanley-Reisner ideal. The main question under investigation in this paper is how to characterize the simplicial complexes such that their Stanley-Reisner ideals have Cohen-Macaulay generic deformations. Algorithms are presented to construct such deformations for matroid complexes, shifted complexes, and tree compl...

متن کامل

Examining the Generic Features of Thesis Acknowledgments: A Case of Iranian MA Graduate Students Majoring in Teaching to Speakers of Other Languages (AZFA) and TEFL

Thesis acknowledgement is a written genre in which MA graduate students offer their gratitude to individuals, who have contributed to the completion of their study. The aim of the current study was to examine the thesis acknowledgements written by Iranian MA students in the field of Persian Language Teaching to Non-Persian Speakers (Amouzeshe Zaban e Farsi be Kharejian, AZFA) and TEFL in terms ...

متن کامل

Author’s response to reviews Title: Evidence-based decision-making for diagnostic and therapeutic methods: the changing landscape of assessment approaches in Germany Authors:

Title: Evidence-based decision-making for diagnostic and therapeutic methods: the changing landscape of assessment approaches in Germany Authors: Britta Olberg ([email protected]) Sabine Fuchs ([email protected]) Katja Matthias ([email protected]) Alexandra Nolting ([email protected]) Matthias Perleth ([email protected]) Reinhard Busse ([email protected]...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998